The outer-connected domination number of a graph
نویسنده
چکیده
For a given graph G = (V,E), a set D ⊆ V (G) is said to be an outerconnected dominating set if D is dominating and the graph G−D is connected. The outer-connected domination number of a graph G, denoted by γ̃c(G), is the cardinality of a minimum outer-connected dominating set of G. We study several properties of outer-connected dominating sets and give some bounds on the outer-connected domination number of a graph. We also show that the decision problem for the outer-connected domination number of a graph G is NP-complete even for bipartite graphs.
منابع مشابه
Bounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کاملOuter-k-connected component domination in graphs
A subset S of the vertices of a graph G is an outer-connected dominating set, if S is a dominating set of G and G − S is connected. The outer-connected domination number of G, denoted by γ̃c(G), is the minimum cardinality of an OCDS of G. In this paper we generalize the outer-connected domination in graphs. Many of the known results and bounds of outer-connected domination number are immediate c...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملOn trees with equal Roman domination and outer-independent Roman domination numbers
A Roman dominating function (RDF) on a graph $G$ is a function $f : V (G) to {0, 1, 2}$satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least onevertex $v$ for which $f(v) = 2$. A Roman dominating function $f$ is called an outer-independentRoman dominating function (OIRDF) on $G$ if the set ${vin Vmid f(v)=0}$ is independent.The (outer-independent) Roman dom...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 38 شماره
صفحات -
تاریخ انتشار 2007